Information Equals Amortized Communication
نویسندگان
چکیده
منابع مشابه
Quantum Information Complexity and Amortized Communication
We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully quantum generalizations of the analogous quantities for bipartite classical functions that have found many applications recently, in particular for proving commun...
متن کاملAmortized Communication Complexity
We thank Mauricio Karchmer and Avi Wigderson for raising the question and for helpful discussions, and Amos Beimel, Benny Chor, Alon Orlitsky and Steve Ponzio for many interesting comments on earlier versions of this paper. Finally, we thank an anonymous referee for his very helpful comments and criticism. 17 For values of`which are around log n we would like to replace the term p ` log n with ...
متن کاملAmortized Communication Complexity
In this work we study the direct-sum problem with respect to communication complexity: Consider a relation f deened over f0; 1g n f0; 1g n. Can the communication complexity of simultaneously computing f onìnstances (x 1 ; y 1); : : : ; (x ` ; y `) be smaller than the communication complexity of computing f on thè instances, separately? Let the amortized communication complexity of f be the comm...
متن کاملAmortized Communication Complexity of an Equality Predicate
We study the communication complexity of the direct sum of independent copies of the equality predicate. We prove that the probabilistic communication complexity of this problem is equal to O(N); computational complexity of the proposed protocol is polynomial in size of inputs. Our protocol improves the result achieved in [11]. Our construction is based on two techniques: Nisan’s pseudorandom g...
متن کاملZero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
We construct zero-knowledge proofs of plaintext knowledge (PoPK) and correct multiplication (PoPC) for the Regev encryption scheme with low amortized communication complexity. Previous constructions of both PoPK and PoPC had communication cost linear in the size of the public key (roughly quadratic in the lattice dimension, ignoring logarithmic factors). Furthermore, previous constructions of P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2347282